|
In the mathematical theory of games, the Penrose square root law, originally formulated by Lionel Penrose, concerns the distribution of the voting power in a voting body consisting of ''N'' members. It states that the ''a priori'' voting power of any voter, measured by the Penrose–Banzhaf index scales like . This result was used to design the Penrose method of for allocating the voting weights of representatives in a decision-making bodies proportional to the square root of the population represented. == Short derivation== To estimate the voting index of any player one needs to estimate the number of the possible winning coalitions in which his vote is decisive. Assume for simplicity that the number of voters is odd, ''N'' = 2''j'' + 1, and the body votes according to the standard majority rule. Following Penrose one concludes that a given voter will be able to effectively influence the outcome of the voting only if the votes split half and half: if ''j'' players say 'Yes' and the remaining ''j'' players vote 'No', the last vote is decisive. Assuming that all members of the body vote independently (the votes are uncorrelated) and that the probability of each vote 'Yes' is equal to ''p'' = 1/2 one can estimate likelihood of such an event using the Bernoulli trial. The probability to obtain ''j'' votes 'Yes' out of 2''j'' votes reads : For large ''N'' we may use the Stirling's approximation for the factorial ''j'' : The same approximation is obtained for an even number ''N''. A mathematical investigation of the influence of possible correlations between the voters for the Penrose square root law was presented by Kirsch.〔 Penrose law is applied to construct Penrose-like systems of two-tier voting, including the Jagiellonian Compromise designed for the Council of the European Union. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Penrose square root law」の詳細全文を読む スポンサード リンク
|